The Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut
نویسندگان
چکیده
Telecommunication networks can be seen as the stacking of several layers like, for instance, IPover-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable IP Network Design problem. We study two variants of this problem with simple and multiple capacities. We give two multicommodity flow formulations for each variant of the problem and describe some valid inequalities. Using these we develop a Branch-and-Cut algorithm and a Branch-and-Cut-andPrice algorithm for each variant and present extensive computational results.
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملDesigning capacitated survivable networks: Polyhedral analysis and algorithms
Designing capacitated survivable networks: Polyhedral analysis and algorithms by Deepak Rajan Doctor of Philosophy in Engineering-Industrial Engineering and Operations Research University of California, Berkeley Professor Alper Atamtürk, Chair In this dissertation, we develop new methodologies and efficient algorithms to solve the capacitated survivable network design problem. Given the graph a...
متن کاملDesign of survivable IP-over-optical networks
In the past years, telecommunications networks have seen an important evolution with the advances in optical technologies and the explosive growth of the Internet. Several optical systems allow a very large transport capacity, and data tra c has dramatically increased. Telecommunications networks are now moving towards a model of high-speed routers interconnected by intelligent optical core net...
متن کاملPartition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failures. Survivability of the network is accomplished by reserving sufficient slack on directed p-cycles so that if an edge fails, its flow can be rerouted along the p-cycles. We describe a model for designing capacitated s...
متن کاملA cutting plane algorithm for the Capacitated Connected Facility Location Problem
We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...
متن کامل